On optimal broadcasting in faulty hypercubes
نویسندگان
چکیده
منابع مشابه
Broadcasting on Faulty Hypercubes
In this paper we propose a method for constructing the maximum number of edge-disjoint spanning trees (in the directed sense) on a hypercube with arbitrary one faulty node. Each spanning tree is of optimal height. By taking the common neighbor of the roots of these edge-disjoint spanning trees as the new root and reversing the direction of the directed link from each root to the new root, a spa...
متن کاملOptimal Time Broadcasting in Faulty Star Networks
This paper investigates fault-tolerant broadcasting in star networks. We propose a non-adaptive single-port broadcasting scheme in the n-star network such that it tolerates n 2 faults in the worst case and completes the broadcasting in O(n log n) time. The existence of such a broadcasting scheme was not known before. A new technique, called di using-and-disseminating, is introduced into the sch...
متن کاملOptimal broadcasting in networks with faulty nodes
Large computer networks are an essential part of modern technology, and quite often information needs to be broadcast to all the computers in the network. If all computers work perfectly all the time, this is simple. Suppose, however, that some of the computers fail occasionally. What is the fastest way to ensure that with high probability all working computers get the information? In this pape...
متن کاملOptimal Broadcasting in Hypercubes with Dynamic Faults
We consider the broadcasting problem in the shouting communication mode in which any node of a network can inform all its neighbours in one time step. In addition, during any time step a number of links less than the edge-connectivity of the network can be faulty. The problem is to nd an upper bound on the number of time steps necessary to complete broadcasting under this additional assumption....
متن کاملOptimal Simulation of Full Binary Trees on Faulty Hypercubes
Abs-t-We study the problem of running full binary tree based algorithms on a hypercube with faulty nodes. The key to this problem is to devise a method for embedding a full binary tree into the faulty hypercube. Based on a novel embedding strategy, we present two results for embedding an (n-1)-tree (a full binary tree with 2"-l-1 nodes) into an n-cube (a hypercube with 2" nodes) with unit dilat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90175-9